Petri nets and resource bisimulation
نویسندگان
چکیده
Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn’t change the Petri net’s behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Petri nets, high-level Petri nets and nested Petri nets — Petri nets with Petri nets as tokens.
منابع مشابه
On the Resource Equivalences in Petri Nets with Invisible Transitions
Two resources (submarkings) are called similar if in any marking any one of them can be replaced by another one without affecting the net’s behaviour (modulo marking bisimulation). It is known that resource similarity is undecidable for general labelled Petri nets. In this paper we study the properties of resource similarity and resource bisimulation (a subset of complete similarity relation, c...
متن کاملSimilarity of Generalized Resources in Petri Nets
Generalized resources are defined as multisets of Petri net vertices. Here places represent material resources (designated by tokens residing in these places). Transitions correspond to activity resources represented by transition firings. Two generalized resources are called similar if in any Petri net marking one resource can be replaced by another without changing the observable system’s beh...
متن کاملPetri Nets and Bisimulations
Several categorical relationships (adjunctions) between models for concurrency have been established, allowing the translation of concepts and properties from one model to another. A central example is a coreflection between Petri nets and asynchronous transition systems. The purpose of the present paper is to illustrate the use of such relationships by transferring to Petri nets a general conc...
متن کامل2 0 Ju l 2 01 3 Homology and Bisimulation of Asynchronous Transition Systems and Petri Nets ∗
Homology groups of labelled asynchronous transition systems and Petri nets are introduced. Examples of computing the homology groups are given. It is proved that if labelled asynchronous transition systems are bisimulation equivalent, then they have isomorphic homology groups. A method of constructing a Petri net with given homology groups is found. 2000 Mathematics Subject Classification 18G35...
متن کاملUndecidability of performance equivalence of Petri nets
We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth case remains an in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 55 شماره
صفحات -
تاریخ انتشار 2003